Hypergraph expanders from Cayley graphs
نویسنده
چکیده
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over Z2 and have vertex degree which is polylogarithmic in the number of vertices. Their expansion properties, which are derived from the underlying Cayley graphs, include analogues of vertex and edge expansion in graphs, rapid mixing of the random walk on the edges of the skeleton graph, uniform distribution of edges on large vertex subsets and the geometric overlap property.
منابع مشابه
Quantum expanders and the quantum entropy difference problem
Classical expanders and extractors have numerous applications in computer science. However, it seems these classical objects have no meaningful quantum generalization. This is because it is easy to generate entropy in quantum computation simply by tracing out registers. In this paper we define quantum expanders and extractors in a natural way. We show that this definition is exactly what is nee...
متن کاملArithmetic Expanders and Deviation Bounds for Sums of Random Tensors
We prove hypergraph variants of the celebrated Alon–Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every odd prime p and any ε > 0, there exists a set of directions D ⊆ Fp of size Op,ε(p (1−1/p+o(1))n) such that for every set A ⊆ Fp of density α, the fraction of lines in A with direction in D is within εα of the fraction of all line...
متن کاملQuantum expanders from any classical Cayley graph expander
We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. Most properties of the classical walk carry over to the quantum operation: degree becomes the number of Kraus operators, the spectral gap becomes the gap of the quantum operation (viewed as a linear map on density matrices), and the quantum operation is efficient whenever the ...
متن کاملON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملCayley Graph Expanders and Groups of Finite Width
We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is given as Cayley graphs of finite groups with very short presentations with only 2 generators and 4 relations. Both families are based on particular finite q...
متن کامل